A Dynamic Distributed Tree Based Tracking Algorithm for Wireless Sensor Networks

We propose a dynamic, distributed tree based tracking algorithm for very fast moving targets in wireless sensor networks, with speeds much higher than reported in literature. The aim of our algorithm is to decrease the miss ratio and the energy consumption while tracking objects that move in high speeds. In order to do this, the root node which is determined dynamically in accordance with the node’s distance to the target, forms lookahead spanning trees along the predicted direction of the target. As the miss ratio decreases, the usage of recovery mechanisms which are employed to detect a target again that is moving away from the predicted trajectory also decreases. This decrease reduces the energy consumption and increases the network lifetime. We describe all the phases of the algorithm in detail and show by simulations that the proposed algorithm performs well to track very fast moving targets. We also compare the algorithm with the generic cluster, generic tree and dynamic multi cluster based tracking algorithms in terms of miss ratio and energy consumption.